A Study on Super Vertex Graceful Graphs
نویسندگان
چکیده
منابع مشابه
Super Vertex Graceful Graphs
For a defined graph labeling, there exists a number of bijective functions for a graph of defined order and size which leads to different graphs. In this paper, a mathematical tool is developed to find the number of super vertex graceful graphs for a defined order “p” and size “q”. Mathematics Subject Classification: 05C78
متن کاملNote on E-super vertex magic graphs
Let G = (V (G), E(G)) be a finite simple graph with p = |V (G)| vertices and q = |E(G)| edges,without isolated vertices or isolated edges. A vertexmagic total labeling is a bijection from V (G) ∪ E(G) to the consecutive integers 1, 2, . . . , p + q, with the property that, for every vertex u in V (G), one has f (u) + uv∈E(G) f (uv) = k for some constant k. Such a labeling is called E-super ve...
متن کاملSuper-edge-graceful labelings of some cubic graphs
The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994. However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.
متن کاملSuper edge-graceful labelings of complete bipartite graphs
Let [n]∗ denote the set of integers {−n−1 2 , . . . , n−1 2 } if n is odd, and {−n 2 , . . . , n 2 } \ {0} if n is even. A super edge-graceful labeling f of a graph G of order p and size q is a bijection f : E(G) → [q]∗, such that the induced vertex labeling f ∗ given by f ∗(u) = ∑ uv E(G) f(uv) is a bijection f ∗ : V (G) → [p]∗. A graph is super edge-graceful if it has a super edge-graceful la...
متن کاملSuper Vertex-magic Total Labelings of Graphs
Let G be a finite simple graph with v vertices and e edges. A vertex-magic total labeling is a bijection λ from V (G)∪E(G) to the consecutive integers 1, 2, · · · , v+e with the property that for every x ∈ V (G), λ(x) + Σy∈N(x)λ(xy) = k for some constant k. Such a labeling is super if λ(V (G)) = {1, · · · , v}. We study some of the basic properties of such labelings, find some families of graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16627-6486